منابع مشابه
WFC3 TV3 Testing: Subarray Photometry
We compare photometry of a star-like object observed with the infrared flight detector of WFC3 (IR-4) using imagery from thermal vacuum test 3 (TV3) in subarray mode to a full-frame image of the same object. The photometry is identical within measurement uncertainty (0.5% r.m.s.) for imagery obtained with the full-frame (1024 pixels by 1024 pixels) and the 64 pixel by 64 pixel subarray. Photome...
متن کاملImproved Algorithms for the K-Maximum Subarray Problem
Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, Bengtsson and Chen presented OðminfK + n logn‚ n ffiffiffiffi K p gÞ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays...
متن کاملOn the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a technique for investigating the SQAP-polytope that is based on projecting the (low-dimensional) polytope into a lower dimensional vector-space, where the vertices have a “more convenient” coordinate structure. We exploi...
متن کاملThe Sequential Knapsack Polytope
In this paper we describe the convex hull of all solutions of the integer bounded knapsack problem in the special case when the weights of the items are divisible. The corresponding inequalities are deened via an inductive scheme that can also be used in a more general setting.
متن کاملThe Circuit Polytope: Facets
Given an undirected graph G = (V;E) and a cost vector c 2 IRE , the weighted girth problem is to nd a circuit in G having minimum total cost. This problem is in general NP-hard since the traveling salesman problem can be reduced to it. A promising approach to hard combinatorial optimization problems is given by the so-called cutting plane methods. These involve linear programming techniques bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.049